An optimum symbol-by-symbol decoding rule for linear codes
نویسندگان
چکیده
A decoding rule is presented which minimizes the probability of symbol error over a time-discrete memoryless channel for any linear error-correcting code when the code words are equiprobable. The complexity of this rule varies inversely with code rate, making the technique particularly attractive for high rate codes. Examples are given for both block and convolutional codes.
منابع مشابه
Symbol-by-Symbol MAP Decoding of Nonbinary Codes
Symbol-by-symbol maximum a posteriori (MAP) decoding algorithms for linear nonbinary block and convolutional codes over both extension elds GF(q = p a) and integer rings Z q are presented. Equivalent MAP decoding rules employing the dual code are given which are computationally more eecient for high-rate codes. The suitabil-ity of the proposed algorithms is demonstrated by applying them to a pa...
متن کاملA Simple One-Sweep Algorithm for Optimal APP Symbol Decoding of Linear Block Codes
Soft-input/soft-output symbol decoding plays a significant role in iterative decoding. We propose a simple optimal soft-input/softoutput symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et al. [1], and the decrease is shown at its most when d...
متن کاملA Simple One Sweep Algorithm for Optimal
| Soft-input/soft-output symbol decoding plays a signiicant role in iterative decoding. We propose a simple optimal soft-input/soft-output symbol decoding algorithm for linear block codes which requires one forward recursion using a trellis. For many codes the decoding complexity is lower than previous methods, such as the algorithm by Bahl et. al. 1], and the decrease is shown at its most when...
متن کاملSymbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملTitle Symbol-by-symbol APP decoding of the Golay code and iterative decoding of concatenated Golay codes
An efficient coset based symbol-by-symbol soft-in/soft-out APP decoding algorithm is presented for the Golay code. Its application in the iterative decoding of concatenated Golay codes is examined.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IEEE Trans. Information Theory
دوره 22 شماره
صفحات -
تاریخ انتشار 1976